Trace complexity
نویسنده
چکیده
Prediction tasks in machine learning usually require deducing a latent variable, or structure, from observed traces of activity — sometimes, these tasks can be carried out with a significant precision and statistical significance, while sometimes getting any useful prediction requires an unrealistically large number of traces. In this talk, we will study the trace complexity of (that is, the number of traces needed for carrying out) two prediction tasks in social networks: the network inference problem and the number of signers problem. The first problem [1] consists of reconstructing the edge set of a network given traces representing the chronology of infection times as epidemics spread through the network. The second problem’s [2] goal is to guess the unknown number of signers of some email-based petitions, when only a small subset of the emails that circulated is available. These two examples will allow us to make some general remarks about social networks’ prediction tasks.
منابع مشابه
Understanding the complexity embedded in large routine call traces with a focus on program comprehension tasks
The analysis of execution traces has been shown to be useful in many software maintenance activities that require a certain understanding of the system’s behaviour. Traces, however, are extremely large, hence are difficult for humans to analyze without effective tools. These tools usually support some sort of trace abstraction techniques that can help users understand the essence of a trace des...
متن کاملThe Interrelationships among Trace Element Cycling, Nutrient Loading, and System Complexity in Estuaries: A Mesocosm Study
Biogeochemical interactions between a suite of trace elements and nutrients were examined in a series of experimental mesocosm experiments to understand how multiple stressors affect estuarine environments and how these effects are modified by the complexity of the system used to examine them. Experimental treatment included additions of nutrients and trace elements separately and combined, alo...
متن کاملComplexity Results for Confluence Problems
We study the complexity of the confluence problem for restricted kinds of semi–Thue systems, vector replacement systems and general trace rewriting systems. We prove that confluence for length– reducing semi–Thue systems is P–complete and that this complexity reduces to NC in the monadic case. For length–reducing vector replacement systems we prove that the confluence problem is PSPACE– complet...
متن کاملOn the alphabetical satisfiability problem for trace equations
In this paper we summarize some results of a work in progress on the computational complexity of the alphabetical satisfiability problem for linear trace equations. In particular we prove that the problem is in P under some conditions on the maximal I-cliques.
متن کاملForays into Sequential Composition and Concatenation in Eagle
The run-time verification logic Eagle is equipped with two forms of binary cut operator, sequential composition ( ; ) and concatenation (·). Essentially, a concatenation formula F1 · F2 holds on a trace if that trace can be cut into two non-overlapping traces such that F1 holds on the first and F2 on the second. Sequential composition differs from concatenation in that the two traces must overl...
متن کاملLinear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
In this correspondence, the linear complexity over of Lempel–Cohn–Eastman (LCE) sequences of period 1 for an odd prime is determined. For = 3 5 and 7, the exact closed-form expressions for the linear complexity over of LCE sequences of period 1 are derived. Further, the trace representations for LCE sequences of period 1 for = 3 and 5 are found by computing the values of all Fourier coefficient...
متن کامل